System for Compiling Word Usage Frequencies

ABSTRACT

A system for assisting a user who is learning a language to prioritize words to be learned in order of usage frequency is disclosed. A frequency determination program running on a computer determines the frequency of usage of each word at a list of locations provided by the user. Different algorithms to identify what constitutes a word are employed depending upon the language of the source data. The total number of words at each location and their usage frequency found during the user session, along with a total number of words and their usage frequency for all user sessions performed regardless of location, are calculated and made available to the user. The user can view usage frequencies for words from a single location, a group of locations, or all user sessions performed.

FIELD OF THE INVENTION

The present invention relates to a system for compiling word usagefrequencies for use in connection with language studies. In particular,the system for compiling word usage frequencies determines usagefrequency of each word in a list of resources to guide a languagestudent regarding which words are the most important to learn.

BACKGROUND OF THE INVENTION

Systems for compiling word usage frequencies are desirable forprioritizing words to be learned by a language student. A tool thatwould enable a student or teacher to determine which words are the mostused in a language would allow such words to be taught and learnedbefore less important words. In order to determine which words are mostused, a student or teacher may look to public information sources suchas news services, and other written documents created in the language bynative users of the language. In to determine the usage frequency fromsuch documents, the student or teacher needs a method to determine usagefrequency of each character and word.

Systems to support language study by determining word and characterusage frequency must be able to analyze written words in languages thatuse an alphabet, known as Latin-based languages, and also in languagesthat use graphics, known as Sino-Tibetan language. As used herein, a“word” comprises one or more “characters” and a character comprises aletter of an alphabet either in a Latin based language or in a graphicin a Sino-Tibetan language. Words and characters may be encoded inUnicode, a universal coding scheme for storing the characters of theworld's major languages.

The use of vocabulary builders is known in the prior art. For example,speech-recognition software, such as Dragon NaturallySpeaking® byScanSoft® and ViaVoice™ by IBM®, include vocabulary building programs.One such vocabulary building program is a vocabulary optimizer programthat refines a language model by scanning documents present in thefolder labeled My Documents and/or e-mail on the user's computer. Thelanguage model at the time of installation includes default statisticsregarding the probability that a given word will be used in the contextof other words that precede it in a group of text. The vocabularyoptimizer program adjusts the default statistics to reflect the contentsof the user's documents.

Another known vocabulary building program is a vocabulary additionprogram that adds words from a user's documents to a vocabulary listallowing the user to select specific documents or the contents of entirefolders from locations accessible by the user's computer. The user hasthe option of displaying a list of words from all the documents in alist that are not in the current vocabulary, along with the number oftimes they are used. The words are presented in alphabetical order or inorder of decreasing usage frequency. The user can then select whichwords from the list will be added to a vocabulary file. The user is alsoinformed of the total number of documents processed, the total number ofwords processed, and the number of words found that were not present inthe program's dictionary.

The vocabulary optimizer program makes no provision for allowing theuser to view the statistics regarding word usage frequency. The usercannot direct the vocabulary optimizer program to scan documents in anylocations other than the My Documents folder. In addition, thevocabulary optimizer program does not scan documents that are older than90 days or documents that are less than 512 bytes in size, and the useris not permitted to adjust these parameters.

The vocabulary addition program only reports the frequency of usage forwords that are not already in the vocabulary addition program'sdictionary or in an associated dictionary. The vocabulary additionprogram does not provide the user with usage frequency statistics foreach individual document. It lacks the ability to calculate frequency ofusage ratios or percentages. It does not allow the user to sort resultsby increasing frequency of usage. It does not track frequency of usageacross multiple sessions of scanning.

The prior art vocabulary optimizer and the vocabulary addition programlack the ability to scan websites to collect frequency of usage data.Neither program allows the user to limit what resources are scannedbased on the number of words they contain.

Therefore, a need exists for a system to determine usage frequency foreach word in list of resources to guide a user regarding which words arethe most important to learn.

SUMMARY OF THE INVENTION

The present invention that meets the needs identified above is aCompiler System (CS) for compiling word usage frequencies in any writtenlanguage and encoding scheme. CS comprises a group of programs, a groupof data files, and an interface. The programs include a FrequencyDetermination Program (FDP), an Analyze Graphic-based Data Program(AGP), an Analyze Alphabet-based Data Program (AAP), and a CalculateResults Program (CRP). The data files include a graphic dictionary, analphabet dictionary, a list of punctuation marks and spaces, a list oflocations, a character list, a location word list, and an overall wordlist. The interface gathers data that directs location or document to beanalyzed, controls the overall search strategy, and determines howresults are displayed.

The FDP instructs the processor to read the list of locations, determinewhether each location is graphic based or alphabet based, execute theAGP for the locations that are graphic based, execute the AAP for thelocations that are alphabet based, execute the CRP, display an outputfrom the CRP, and combine the location word list with the overall wordlist to record the frequency of all words found by the FDP.

The AGP may populate the location word list with each unique word foundat each of the graphic-based locations and a number of times the word ispresent by matching a string of characters to the graphic dictionary.The AAP may populate the location word list with each unique word foundat each of the alphabet-based locations and a number of times the wordis present by locating a string of characters located between characterslisted in the list of punctuation marks and spaces. The CRP maycalculate word usage frequencies as a ratio and a percentage for eachlocation, or across all locations. The output from the CRP may beuser-configurable to be displayed by individual location, a group oflocations, or as a total of all locations.

BRIEF DESCRIPTION OF THE DRAWINGS

The novel features believed characteristic of the invention are setforth in the appended claims. The invention itself, however, as well asa preferred mode of use, further objectives and advantages thereof, willbe understood best by reference to the following detailed description ofan illustrative embodiment when read in conjunction with theaccompanying drawings, wherein:

FIG. 1 is a schematic view of the current embodiment of the CompilerSystem;

FIG. 2 is a schematic view of the computer configuration of the CompilerSystem;

FIG. 3 is a flow diagram view of the Frequency Determination Program(FDP) of the present invention;

FIG. 4 is a flow diagram view of the Analyze Graphic-based Data Program(AGP) of the present invention;

FIG. 5 is a flow diagram view of the Analyze Alphabet-based Data Program(AAP) of the present invention;

FIG. 6 is a flow diagram view of the calculate results program (CRP) ofthe present invention;

FIG. 7 is a schematic view of the interface of the Compiler System (CS);

FIG. 8 is a schematic view of the location word list of the presentinvention; and

FIG. 9 is a schematic view of the overall word list of the presentinvention.

The same reference numerals refer to the same parts throughout thevarious figures.

DESCRIPTION OF THE CURRENT EMBODIMENT

The principles of the present invention are applicable to a variety ofcomputer hardware and software configurations. The term “computerhardware” or “hardware,” as used herein, refers to any machine orapparatus that is capable of accepting, performing logic operations on,storing, or displaying data, and includes without limitation processorsand memory; the term “computer software” or “software,” refers to anyset of instructions operable to cause computer hardware to perform anoperation. A “computer,” as that term is used herein, includes withoutlimitation any useful combination of hardware and software, and a“computer program” or “program” includes without limitation any softwareoperable to cause computer hardware to accept, perform logic operationson, store, or display data. A computer program may, and often is,comprised of a plurality of smaller programming units, including withoutlimitation subroutines, modules, functions, methods, and procedures.Thus, the functions of the present invention may be distributed among aplurality of computers and computer programs. The invention is describedbest, though, as a single computer program that configures and enablesone or more general-purpose computers to implement the novel aspects ofthe invention.

FIG. 1 illustrates Compiler System 100 for determining word andcharacter (when the character is a word) usage frequency. CompilerSystem 100 achieves this by running programs on computer 110 to scanresources accessible to computer 110. Resources can be stored indatabase 120, which most commonly is computer's 110 hard drive.Resources can include documents and e-mail. Additional resources can beaccessed using network 130, including the Internet. Resources can alsobe website 150 having web pages 160 posted on web server 140.

FIG. 2 illustrates computer configuration 200 of computer 110. Moreparticularly, computer configuration 200 shows processor 220 and memory210 of computer 110. Memory 210 stores graphic dictionary 230, list ofpunctuation marks and spaces 240, character list 250, location wordlists 800, overall word list 900, list of locations 280, minimum numberof words 260, and depth 270. Frequency determination program (FDP) 300,analyze graphic-based data program (AGP) 400, analyze alphabet-baseddata program (AAP) 500, and calculate results program (CRP) 600 areloaded into memory 210 and provide instructions to processor 220. FDP300 determines word and character usage frequency by employingsubroutines in the form of AGP 400, AAP 500, and CRP 600.

FIG. 3 illustrates FDP 300. FDP 300 begins (302) by receiving inputprovided by user interface 700 (see FIG. 7). After loading data from afirst location 702 in list of locations 280 (306), FDP 300 determines ifthe data is graphic based (380). This can be accomplished easily if thedata is encoded in Unicode. If the data is not encoded in Unicode, atranslator program can be employed to convert the data from its nativeformat to Unicode. If the data is graphic based, then FDP 300 runs AGP400. If the data is not graphic based, FDP 300 determines if the data isalphabet based (310). If it is, then FDP 300 runs AAP 500. If the datais not alphabet based, then FDP 300 reports an error (312) and proceedsto step 318.

Once AGP 400 or AAP 500 has executed, FDP 300 passes location word list800 to CRP 600 to calculate the results for the location 702 (314). FDP300 then determines if the location 702 has a number of words greaterthan or equal to the quantity stored in depth 270 (316). If the location702 lacks sufficient words 716, location word list 800 is discarded(318). If there is a sufficient number of words 716, or after thecompletion of steps 312 or 318, FDP 300 determines if all locations havebeen analyzed (320). If all locations have not been analyzed, FDP 300loads data from the next location 702 in list of locations 280 (319) andreturns to step 308.

After all locations have been analyzed, FDP 300 combines location wordlists 800 with overall word lists 900 to create a new overall word lists900 (322). FDP 300 then passes overall word list 900 to CRP 600 tocalculate the results for overall word lists 900 (324). After theresults are calculated, FDP 300 displays results using user interface700 (326) and then terminates (328).

FIG. 4 illustrates AGP 400. More particularly, AGP 400 analyzes graphiclanguages. AGP 400 begins (402) by adding locations 702 to characterlist 250. AGP 400 uses list of punctuation marks and spaces 240 tosearch for a match to character list 250 (406). List of punctuationmarks and spaces 240 includes punctuation marks and spaces from allwritten languages, along with end of line, end of paragraph, and end offile codes. If a match is found (408), character list 250 is cleared(410), and AGP 400 determines if there is a next character (412). Ifthere is a next character, it is added to character list 250 (414), andAGP 400 returns to step 406. If there is not a next character, then AGP400 terminates (442). Steps 406-414 ensure that any leading punctuationmarks are not analyzed as being potential words 716.

If a match is not found in step 408, graphic dictionary 230 is searchedfor an entry that begins with character list 250 (416). If a match isfound in step 418, AGP 400 determines if there is a next character(420). If there is a next character, then graphic dictionary 230 issearched for an entry that begins with the character in character list250 and the next character (422). If a match is found in step 424, thenthe next character is added to character list 250 (426), and AGP 400returns to step 420.

Graphic dictionary 230 enables AGP 400 to determine the end of a wordsince a word may consist on one graphic character or a plurality ofgraphic characters. In an alternate embodiment, AGP 400 may operatewithout the dictionary and provide a count of all frequencies. Such anembodiment would be a configurable option, at the user's discretion forthe purpose of reducing processing time.

Persons skilled in the art will be aware that the graphic dictionaryneeds to have the same encoding scheme as the data in the search file,but that if the encoding schemes are different, CS 100 may call up aroutine to convert the data in the search file to the same encodingscheme as the dictionary. Alternatively, CS 100 may have multipledictionaries in multiple encoding schemes. In the preferred embodiment,graphic dictionary 230 is Unicode.

If a match is not found in steps 418 or 424, or if a next character isnot found in step 420, then character list 250 is added to location wordlist 800 for the location 702 (428) as word 716. Counter 802 associatedwith word 716 is incremented by one (430), and character list 250 iscleared (432). AGP 400 then determines if there is a next character(434). If there is not, then AGP 400 terminates (442).

If there is a next character, then it is added to character list 250(436). List of punctuation marks and spaces 240 is then searched for amatch to character list 250 (438). If step 440 determines there is amatch, then AGP 400 returns to step 432. Steps 438 and 440 ensure thatany leading punctuation marks are not analyzed as being potential words716. Once step 440 determines there is not a match, AGP 400 returns tostep 416.

In summation, after ensuring that the first character is not apunctuation mark, AGP 400 identifies one or more characters fromlocation 702 and attempts to find the character(s) in graphic dictionary230. If a character string is present in the dictionary, then thepresent invention proceeds to the counting component (steps 428 and 430)with word 716. If there is no match in graphic dictionary 230, then thefirst character passes to the counting component. After passing acharacter or word 716 to the counting component, AGP 400 proceeds to thenext character at location 702 that was not part of the previous word716 or character after ensuring it is not a punctuation mark.

FIG. 5 illustrates Analyze Alphabet-based Data Program (AAP) 500. AAP500 analyzes alphabet-based languages. AAP 500 begins (502) by addinglocations 702 to character list 250. AAP 500 uses list of punctuationmarks and spaces 240 to search for a match to character list 250 (506).If a match is found (508), character list 250 is cleared (510), and AAP500 determines if there is a next character (512). If there is a nextcharacter, it is added to character list 250 (514), and AAP 500 returnsto step 506. If there is not a next character, then AAP 500 terminates(538). Steps 506-514 ensure that any leading punctuation marks are notanalyzed as being potential words 716.

If a match is not found in step 508, AAP 500 determines if there is anext character (516). If there is, list of punctuation marks and spaces240 is then searched for a match to the next character (518). If a matchis not found in step 520, the next character is added to the characterlist 250 (522), and AAP 500 returns to step 516.

If a match is found in step 520, or if there is not a next character instep 516, then character list 250 is added to location word list 800 forlocation 702 (524) as word 716. Counter 802 associated with word 716 isincremented by one (526), and character list 250 is cleared (528). AAP500 then determines if there is a next character (530). If there is not,then AAP 500 terminates (538).

If there is a next character, then it is added to character list 250(532). List of punctuation marks and spaces 240 is then searched for amatch to character list 250 (534). If step 536 determines there is amatch, then analyze AAP 500 returns to step 528. Steps 534 and 536ensure that any leading punctuation marks are not analyzed as beingpotential words 716. Once step 536 determines there is not a match, AAP500 returns to step 516.

In summation, AAP 500 pulls in one or more characters from location 702until it encounters a space or punctuation character after ensuring thatthe first character is not a punctuation mark. This constitutes word716, and the process proceeds to the counting component (steps 524 and526). AAP 500 then proceeds to the next character at location 702 thatwas not part of the previous word 716 after ensuring it is not apunctuation mark.

FIG. 6 illustrates Calculate Results Program (CRP) 600. CRP 600 receiveslocation word list 800 or overall word list 900 from FDP 300 and begins(602) by adding all of counters 802 to calculate total number of words714 found (604). CRP 600 divides total number of words 714 by the valueof each counter 802 to calculate ratios 804 (606). CRP 600 thencalculates percentages 806 by dividing the value of each counter 802 bytotal number of words 714 and multiplying the result by 100 (608). Theresults are stored in either location word list 800 or overall word list900, depending upon which was received from frequency determinationprogram 300. CRP 600 then terminates (612).

In summation, CRP 600 performs several functions. First, it calculatestotal number of words 716 found. Second, it determines the usagefrequency of each word 716. CRP 600 may express the usage frequency asratio 804 or percentage 806. For example, a word 716 that occurs 50times in 10,000 words has a usage ratio of 1:200 and occurs 0.5% of thetime.

FIG. 7 illustrates user interface 700 of the present invention. Moreparticularly, user interface 700 gathers data that directs frequencydetermination program 300 to locations 702 to be analyzed, controls theoverall search strategy, and determines how results are displayed. Theuser provides one or more locations 702 to form a list of locations 280.Locations 702 can be website 150 addresses, local and/or remote filelocations, e-mail accounts, or any other source containing text. Depth270 allows the user to specify how deeply into the website 150 thesearch is to take place. The frequency determination program 300 willstop when it has either traced all of the website's 150 hyperlinks tothe depth 270 specified or has fully searched the entire website 150without reaching the specified depth 270.

Besides the basic searching capabilities described above, the user mayalso specify that a minimum number of words 260 must be present beforesearching a particular website 150. This is accomplished by entering avalue into minimum number of words 260. This ensures that the user getsa good statistical sample.

After clicking the analyze button 726 to initiate frequencydetermination program 300, frequency determination program 300 returns alist of words 716 found ranked by frequency of usage, supplies thenumber of times it found a given word or character via counter 718, andreports each word's 716 usage ratio 720 and percentage 722. Frequencydetermination program 300 also provides total number of words 714 found.

The user has the option of viewing a number of usage frequencies. Toview usage frequency based on a cumulative total of all the searchesever performed, the user selects overall 706. Overall word list 900maintains a total count for each word 716 or character in counter 802,which can be used to calculate total number of all words 714 found.Alternatively, the user can find usage frequencies for a single file orweb page 160, particular websites 150, or for a class of websites 150 byselecting by location 708 and one or more locations 702 in a list 710.Apply filter 712 determines how results are presented to the user. Theuser also has the option of sorting the results from highest to lowestfrequency 724 or from lowest to highest frequency 726.

FIG. 8 illustrates location word list 800 of the present invention. Moreparticularly, location word list 800 stores each word 716 found during asingle user session. Location word list 800 also stores counter 802,ratio 804, and percentage 806 associated with each word 716 by location702. Location word list 800 allows the user to view results for aparticular location 702 or for a group of locations 702.

FIG. 9 illustrates overall word list 900 of the present invention. Moreparticularly, overall word list 900 stores each word 716 and counter718, ratio 720, and percentage 722 associated with each word 716 thatfrequency determination program 300 has ever found. Overall word list900 persists after a given user session to maintain a cumulative recordof the results of all user sessions.

CS 100 includes a method for compiling word usage frequencies comprisingthe steps of obtaining a list of locations having words to be counted,counting a number of times each of the words is present at each of thelocations in the list, calculating a total number of words present ateach of the locations in the list, and displaying the total number oftimes a word is present at each of the locations in the list and thetotal number of words present at each of the locations in the list. Themethod may further comprises the steps of calculating a location wordfrequency ratio by dividing the total number of words present at each ofthe locations in the list by the number of times each word is present ateach of the locations in the list and displaying the location wordfrequency ratio for each of the words present at each of the locationsin the list. The method may further comprise the steps of calculating alocation word frequency percentage by dividing the number of times eachword is present at each of the locations in the list by the total numberof words present at each of the locations in the list, multiplying by100, and displaying the location word frequency percentage for each ofthe words present at each of the locations in the list.

The method further comprise the steps of calculating an overall wordfrequency ratio by adding the total number of words present at all ofthe locations in the list, adding the total number of times each word ispresent at any of the locations in the list, dividing the total numberof words present at all of the locations in the list by the total numberof times each word is present at any of the locations in the list, anddisplaying the overall word frequency ratio for each of the wordspresent at any of the locations in the list. The method may furthercomprise the steps of calculating an overall word frequency percentageby adding the total number of words present at all of the locations inthe list, adding the total number of times each word is present at anyof the locations in the list, dividing the total number of times eachword is present at any of the locations in the list by the total numberof words present at all of the locations in the list, multiplying by100, and displaying the overall word frequency percentage for each ofthe words present at any of the locations in the list.

The depth to which the method traverses the hyperlinks to count thenumber of times each of the words is present at the websites may be userconfigurable. The total number of words present at a location in thelist may have to equal or exceed a user-configurable quantity for thestep of displaying a total number of times a word is present at each ofthe locations in the list and a total number of words present at each ofthe locations in the list to be performed for that location. Prior toperforming the step of calculating a total number of words present ateach of the locations in the list, the method may determine if the wordsat the locations are graphic based or alphabet based.

The step of calculating a total number of words present at each of thelocations in the list may comprise the steps of (a) adding a firstcharacter to a character list; (b) searching a list of punctuation marksand spaces for a match to the character list; (c) responsive to findinga match in step (b), clearing the character list; (d) responsive tofinding a match in step (b), determining if there is a next character;(e) responsive to finding a next character in step (d), adding the nextcharacter to the character list; (f) responsive to finding a nextcharacter in step (d), repeating steps (b)-(f); (g) responsive todetermining the words at the location are graphic based and responsiveto not finding a match in step (b), searching a graphic dictionary for amatch to the character list; (h) responsive to determining the words atthe location are graphic based and responsive to finding a match insteps (g) or (i), determining if there is a next character; (i)responsive to determining the words at the location are graphic basedand responsive to finding a next character in step (h), searching thegraphic dictionary for a match to the character list and the nextcharacter; k) responsive to determining the words at the location aregraphic based and responsive to finding a match in step (i), adding thenext character to the character list; (k) responsive to determining thewords at the location are graphic based and responsive to finding a nextcharacter is present in step (h), repeating steps (h)-(k); (l)responsive to determining the words at the locations are graphic basedand responsive to not finding a match in steps (g) or (i) or a nextcharacter in step (h), adding the character list to a location wordlist; (m) responsive to determining the words at the location arealphabet based, determining if there is a next character; (n) responsiveto determining the words at the location are alphabet based andresponsive to finding a next character in step (m), searching the listof punctuation marks and spaces for the next character; (o) responsiveto determining the words at the locations are alphabet based andresponsive to not finding a match in step (n), repeating steps (m)-(o);(p) responsive to determining the words at the location are alphabetbased and responsive to not finding a next character in step (m) orfinding a match in step (n), adding the character list to the locationword list; (q) incrementing a counter in the location word list; (r)clearing the character list; (s) determining if there is a nextcharacter; (t) responsive to finding a next character in step (s),adding the next character to the character list; (u) responsive tofinding a next character in step (s), searching the list of punctuationmarks and spaces for a match to the character list; (v) responsive tofinding a match in step (u), repeating steps (r)-(v); (w) responsive todetermining the words at the location are graphic based and responsiveto not finding a match in step (u), repeating steps (g)-(w); (x)responsive to determining the words at the location are alphabet basedand responsive to not finding a match in step (u), repeating steps(m)-(x); and (y) adding the counters associated with the location wordlist together to calculate the total number of times a word is presentat each of the locations in the list.

The method of CS 100 is operable in an apparatus comprising a processor,memory, and a network connection to a web server hosting a web site.There are, of course, additional features of the invention that will bedescribed hereinafter and which will form the subject matter of theclaims attached.

Persons skilled in the art understood that there are a number of ways touse CS 100. CS 100 may use its search results itself. Particularly forSino-Tibetan languages with a large number of graphic characters, ofwhich only a small percentage are used in day to day communication, CS100 can build its own dictionary of the most commonly used characters.CS 100 can then search this dictionary to find a word before searchingthe full dictionary.

CS 100 may also function as a callable module to another program. Theprogram calling the present invention may direct a search and utilizethe results, or it may simply call the present invention with a word andobtain a usage frequency from a search done previously. Other programsmay use the present invention to rank the words in the program'sdictionary and determine the order in which to teach words to thestudent.

CS 100 may function in a standalone fashion by interacting with a user,obtaining its search instructions from the user, and providing theresults directly to the user. When the user is directing a search at aparticular source, the usage frequency data is determined for thatsource. A ranking of the most often used words in that source willmotivate the user to learn those words. Using the various usagefrequencies, the present invention can provide rankings for a singlesource, a class of sources in general, or for general language use.

In addition, for graphic languages, CS 100 can break down words intoindividual characters and extract the definitions for each characterfrom the dictionary. It can then present this information to the userfor educational purposes.

With respect to the above description of CS 100, it is to be realizedthat the optimum dimensional relationships for the parts of theinvention, to include variations in size, materials, shape, form,function and manner of operation, assembly and use, are deemed readilyapparent and obvious to one skilled in the art, and all equivalentrelationships to those illustrated in the drawings and described in thespecification are intended to be encompassed by the present invention.Although determining usage frequency of each word in a list of resourcesto guide a user regarding which words are the most important to learnhas been described, it should be appreciated that the system forcompiling word usage frequencies herein described is also suitable forcreating vocabularies for speech-recognition systems. A wide variety ofword identification algorithms may be used instead of AGP 400 and AAP500 described above.

Furthermore, the CS 100 may be integrated with other programs. Suchintegration with other program may allow input from those programs, andalternatively, may allow usage frequency to be provided to theintegrated programs. For example, handwriting recognition software mayprovide input for processing by the present invention, and educationalsoftware may use frequency data from the invention to determine whichwords to teach first. Besides searching files and determining usagefrequency, the present invention may simply return a usage frequencyvalue to a calling program when supplied with a particular word orcharacter.

Therefore, the foregoing is considered as illustrative only of theprinciples of the Compiler System. Further, since numerous modificationsand changes will readily occur to those skilled in the art, it is notdesired to limit the invention to the exact construction and operationshown and described, and accordingly, all suitable modifications andequivalents may be resorted to, falling within the scope of theinvention.

1. A method for compiling word usage frequencies comprising the stepsof: (a) obtaining a list of locations having words to be counted; (b)counting a number of times each of said words is present at each of saidlocations in said list; (c) calculating a total number of words presentat each of said locations in said list; and (d) displaying a totalnumber of times a word is present at each of said locations in said listand a total number of words present at each of said locations in saidlist.
 2. The method of claim 1, further comprising the steps of:calculating a location word frequency ratio by dividing the total numberof words present at each of said locations in said list by the number oftimes each word is present at each of said locations in said list; anddisplaying said location word frequency ratio for each of said wordspresent at each of said locations in said list.
 3. The method of claim1, further comprising the steps of: calculating a location wordfrequency percentage by dividing said number of times each word ispresent at each of said locations in said list by said total number ofwords present at each of said locations in said list and multiplying by100; and displaying said location word frequency percentage for each ofsaid words present at each of said locations in said list.
 4. The methodof claim 1, further comprising the steps of: calculating an overall wordfrequency ratio by adding said total number of words present at all ofsaid locations in said list, adding said total number of times each wordis present at any of said locations in said list, and dividing saidtotal number of words present at all of said locations in said list bysaid total number of times each word is present at any of said locationsin said list; and displaying said overall word frequency ratio for eachof said words present at any of said locations in said list.
 5. Themethod of claim 1, further comprising the steps of: calculating anoverall word frequency percentage by adding said total number of wordspresent at all of said locations in said list, adding said total numberof times each word is present at any of said locations in said list,dividing said total number of times each word is present at any of saidlocations in said list by said total number of words present at all ofsaid locations in said list, and multiplying by 100; and displaying saidoverall word frequency percentage for each of said words present at anyof said locations in said list.
 6. The method of claim 1, wherein saidlocations are selected from the group consisting of documents,electronic mail, and websites having hyperlinks.
 7. The method of claim6, wherein the depth to which said method traverses said hyperlinks tocount said number of times each of said words is present at saidwebsites is user configurable.
 8. The method of claim 1, wherein saidtotal number of words present at said location in said list must equalor exceed a user-configurable quantity for step (d) to be performed forsaid location.
 9. The method of claim 1, wherein prior to performingstep (b), said method determines if said words at said locations aregraphic based or alphabet based.
 10. The method of claim 9, wherein saiddetermination if said words at said locations are graphic based oralphabet based uses Unicode encoding of said words at said locations.11. The method of claim 9, wherein step (b) comprises the steps of: (a)adding a first character to a character list; (b) searching a list ofpunctuation marks and spaces for a match to said character list; (c)responsive to finding a match in step (b), clearing the character list;(d) responsive to finding a match in step (b), determining if there is anext character; (e) responsive to finding a next character in step (d),adding said next character to said character list; (f) responsive tofinding a next character in step (d), repeating steps (b)-(f); (g)responsive to determining said words at said location are graphic basedand responsive to not finding a match in step (b), searching a graphicdictionary for a match to said character list; (h) responsive todetermining said words at said location are graphic based and responsiveto finding a match in steps (g) or (i), determining if there is a nextcharacter; (i) responsive to determining said words at said location aregraphic based and responsive to finding a next character in step (h),searching said graphic dictionary for a match to said character list andsaid next character; (j) responsive to determining said words at saidlocation are graphic based and responsive to finding a match in step(i), adding said next character to said character list; (k) responsiveto determining said words at said location are graphic based andresponsive to finding a next character is present in step (h), repeatingsteps (h)-(k); (l) responsive to determining said words at said locationare graphic based and responsive to not finding a match in steps (g) or(i) or a next character in step (h), adding said character list to alocation word list; (m) responsive to determining said words at saidlocation are alphabet based, determining if there is a next character;(n) responsive to determining said words at said location are alphabetbased and responsive to finding a next character in step (m), searchingsaid list of punctuation marks and spaces for said next character; (o)responsive to determining said words at said location are alphabet basedand responsive to not finding a match in step (n), repeating steps(m)-(o); (p) responsive to determining said words at said location arealphabet based and responsive to not finding a next character in step(m) or finding a match in step (n), adding said character list to saidlocation word list; (q) incrementing a counter in said location wordlist; (r) clearing said character list; (s) determining if there is anext character; (t) responsive to finding a next character in step (s),adding said next character to said character list; (u) responsive tofinding a next character in step (s), searching said list of punctuationmarks and spaces for a match to said character list; (v) responsive tofinding a match in step (u), repeating steps (r)-(v); (w) responsive todetermining said words at said location are graphic based and responsiveto not finding a match in step (u), repeating steps (g)-(w); (x)responsive to determining said words at said location are alphabet basedand responsive to not finding a match in step (u), repeating steps(m)-(x); and (y) adding said counters associated with said location wordlist together to calculate said total number of times a word is presentat said location in said list.
 12. The method of claim 1, wherein saidmethod is operable in an apparatus comprising a processor and memory.13. The method of claim 12, wherein said apparatus further comprises anetwork connection to a web server containing a website.
 14. The methodof claim 12 wherein results are displayed on a user-interface.
 15. Themethod of claim 12 wherein locations to be analyzed are selected on auser-interface. 16.-25. (canceled)
 26. A method for compiling word usagefrequencies comprising the steps of: (a) obtaining a list of locationshaving words to be counted; (b) obtaining a minimum number of words thatmust be present at each location; (c) obtaining a depth of hyperlinks tobe traversed for each location; (d) calculating a total number of wordspresent at each of said locations in said list; (e) responsive tofinding a location has at least said minimum number of words, counting anumber of times each of said words is present at that location; and (f)displaying a total number of times a word is present at each of saidlocations in said list having said minimum number of words and a totalnumber of words present at each of said locations having said minimumnumber of words in said list.
 27. The method of claim 26, furthercomprising the steps of: calculating a location word frequency ratio bydividing the total number of words present at each of said locations insaid list by the number of times each word is present at each of saidlocations in said list; displaying said location word frequency ratiofor each of said words present at each of said locations in said list;calculating a location word frequency percentage by dividing said numberof times each word is present at each of said locations in said list bysaid total number of words present at each of said locations in saidlist and multiplying by 100; displaying said location word frequencypercentage for each of said words present at each of said locations insaid list; calculating an overall word frequency ratio by adding saidtotal number of words present at all of said locations in said list,adding said total number of times each word is present at any of saidlocations in said list, and dividing said total number of words presentat all of said locations in said list by said total number of times eachword is present at any of said locations in said list; displaying saidoverall word frequency ratio for each of said words present at any ofsaid locations in said list; calculating an overall word frequencypercentage by adding said total number of words present at all of saidlocations in said list, adding said total number of times each word ispresent at any of said locations in said list, dividing said totalnumber of times each word is present any of said locations in said listby said total number of words present at all of said locations in saidlist, and multiplying by 100; and displaying said overall word frequencypercentage for each of said words present at any of said locations insaid list.
 28. The method of claim 26, wherein prior to performing step(d), said method determines if said words at said locations are graphicbased or alphabet based.
 29. The method of claim 26, wherein saiddetermination if said words at said locations are graphic based oralphabet based uses Unicode encoding of said words at said locations.30. The method of claim 26, wherein step (d) comprises the steps of: (a)adding a first character to a character list; (b) searching a list ofpunctuation marks and spaces for a match to said character list; (c)responsive to finding a match in step (b), clearing the character list;(d) responsive to finding a match in step (b), determining if there is anext character; (e) responsive to finding a next character in step (d),adding said next character to said character list; (f) responsive tofinding a next character in step (d), repeating steps (b)-(f); (g)responsive to determining said words at said location are graphic basedand responsive to not finding a match in step (b), searching a graphicdictionary for a match to said character list; (h) responsive todetermining said words at said location are graphic based and responsiveto finding a match in steps (g) or (i), determining if there is a nextcharacter; (i) responsive to determining said words at said location aregraphic based and responsive to finding a next character in step (h),searching said graphic dictionary for a match to said character list andsaid next character; (j) responsive to determining said words at saidlocation are graphic based and responsive to finding a match in step(i), adding said next character to said character list; (k) responsiveto determining said words at said location are graphic based andresponsive to finding a next character is present in step (h), repeatingsteps (h)-(k); (l) responsive to determining said words at said locationare graphic based and responsive to not finding a match in steps (g) or(i) or a next character in step (h), adding said character list to alocation word list; (m) responsive to determining said words at saidlocation are alphabet based, determining if there is a next character;(n) responsive to determining said words at said location are alphabetbased and responsive to finding a next character in step (m), searchingsaid list of punctuation marks and spaces for said next character; (o)responsive to determining said words at said location are alphabet basedand responsive to not finding a match in step (n), repeating steps(m)-(o); (p) responsive to determining said words at said location arealphabet based and responsive to not finding a next character in step(m) or finding a match in step (n), adding said character list to saidlocation word list; (q) incrementing a counter in said location wordlist; (r) clearing said character list; (s) determining if there is anext character; (t) responsive to finding a next character in step (s),adding said next character to said character list; (u) responsive tofinding a next character in step (s), searching said list of punctuationmarks and spaces for a match to said character list; (v) responsive tofinding a match in step (u), repeating steps (r)-(v); (w) responsive todetermining said words at said location are graphic based and responsiveto not finding a match in step (u), repeating steps (g)-(w); (x)responsive to determining said words at said location are alphabet basedand responsive to not finding a match in step (u), repeating steps(m)-(x); and (y) adding said counters associated with said location wordlist together to calculate said total number of words present at saidlocation in said list.
 31. The method of claim 26, wherein said methodis operable in an apparatus comprising a processor, memory, and anetwork connection to a web server hosting a website.
 32. The method ofclaim 31 wherein a location and a depth are entered into an interface.